Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph
نویسندگان
چکیده
We give an eecient algorithm for maintaining a minimum spanning forest of a plane graph subject to on-line modiications. The modii-cations supported include changes in the edge weights, and insertion 1 and deletion of edges and vertices which are consistent with the given embedding. To implement the algorithms, we develop a data structure called an edge-ordered dynamic tree, which is a variant of the dynamic tree data structure of Sleator and Tarjan. Using this data structure, our algorithm runs in O(log n) time per operation and O(n) space. The algorithm can be used to maintain the connected components of a dynamic planar graph in O(log n) time per operation. We also show that any algorithm will need (log n) amortized time per operation, given a set of machine operations that is fairly general.
منابع مشابه
Advanced Topics in Algorithms
[1] David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, and Moti Yung. Corrigendum: Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms, 15(1), 1993. [2] Andrew V. Goldberg and Robert E. Tarjan. Finding minimum-cost circulations by successive approximation. Math. Oper. Res., 15(3):430–466, July 1990. [3] Jacob Holm, Kristi...
متن کاملSpectral-spatial classification of hyperspectral images by combining hierarchical and marker-based Minimum Spanning Forest algorithms
Many researches have demonstrated that the spatial information can play an important role in the classification of hyperspectral imagery. This study proposes a modified spectral–spatial classification approach for improving the spectral–spatial classification of hyperspectral images. In the proposed method ten spatial/texture features, using mean, standard deviation, contrast, homogeneity, corr...
متن کاملPoly - Logarithmic Deterministic Fully - Dynamic GraphAlgorithms I : Connectivity and Minimum Spanning Tree
Deterministic fully dynamic graph algorithms are presented for con-nectivity and minimum spanning forest. For connectivity, starting with no edges, the amortized cost for maintaining a spanning forest is O(log 2 n) per update, i.e. per edge insertion or deletion. Deciding connectivity between any two given vertices is done in O(log n= log log n) time. This matches the previous best randomized b...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملMaintaining dynamic graph properties deterministically
In this paper we present deterministic fully dynamic algorithms for maintaining several properties on undirected graphs subject to edge insertions and deletions, in polylogarithmic time per operation. Combining techniques from [6, 10], we can maintain a minimum spanning forest of a graph with k different edge weights in O(k log n) amortized time per update; maintain an 1+ -approximation of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 13 شماره
صفحات -
تاریخ انتشار 1992